Tessellating and Searching Uncertain State Spaces

نویسندگان

  • A. Meystel
  • A. Bathija
چکیده

Multiresolutional S-search generated a need to properly tessellate spaces and efficiently searching them. Drexel University has introduced MR-methodology such as uniform and non-uniform space tessellation and efficient algorithms of searching within ressellated state space. This methodology for solving planning and control problems is successfully applied in autonomous vehicles, industrial robots and power stations. This paper focuses on computational phenomena characteristic for randomized tessellation and affecting the results of S-search.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-zero probability of nearest neighbor searching

Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

متن کامل

A new switching strategy for exponential stabilization of uncertain discrete-time switched linear systems in guaranteed cost control problem

Uncertain switched linear systems are known as an important class of control systems. Performance of these systems is affected by uncertainties and its stabilization is a main concern of recent studies. Existing work on stabilization of these systems only provides asymptotical stabilization via designing switching strategy and state-feedback controller. In this paper, a new switching strate...

متن کامل

Minimax games for stochastic systems subject to relative entropy uncertainty: applications to SDEs on Hilbert spaces

In this paper we consider minimax games for stochastic uncertain systems with the pay-off being a nonlinear functional of the uncertain measure where the uncertainty is measured in terms of relative entropy between the uncertain and the nominal measure. The maximizing player is the uncertain measure, while the minimizer is the control which induces a nominal measure. Existence and uniqueness of...

متن کامل

Variable Resolution Spatial Interpolation Using The Simple Recursive Point Voronoi Diagram

The basic Voronoi concept involves tessellating an m-dimensional space with respect to a finite set of objects by assigning all locations in the space to the closest member of the object set. This concept can be operationalised in a variety of ways by considering different methods for determining “closeness”, subsets of objects rather than individual objects as generators, moving objects, and d...

متن کامل

Searching for Good Solutions in Goal-Dense Search Spaces

In this paper we explore the challenges surrounding searching effectively in problems with preferences. These problems are characterized by a relative abundance of goal states: at one extreme, if every goal is soft, every state is a goal state. We present techniques for planning in such search spaces, managing the sometimes-conflicting aims of intensifying search around states on the open list ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002